Strong Approximations of Martingale Vectors and Their Applications in Markov-Chain Adaptive Designs
نویسندگان
چکیده
The strong approximations of a class of R-valued martingales are considered. The conditions used in this paper are easier to check than those used in [3] and [9]. As an application, the strong approximation of a class of non-homogenous Markov chains is established, and the asymptotic properties are established for the multi-treatment Markov chain adaptive designs in clinical trials.
منابع مشابه
Asymptotic Properties of Adaptive Designs via Strong Approximations∗
Various adaptive designs have been proposed and applied to clinical trials, bioassay, psychophysics, etc. More and more people have been paying attention to these design methods. Via strong approximations, this paper presents asymptotic properties of several broad families of designs, such as the play-the-winner rule, randomized play-the-winner rule and its generalization to the multi-arm case,...
متن کاملA strong law of large numbers for martingale arrays
Abstract: We prove a martingale triangular array generalization of the Chow-BirnbaumMarshall’s inequality. The result is used to derive a strong law of large numbers for martingale triangular arrays whose rows are asymptotically stable in a certain sense. To illustrate, we derive a simple proof, based on martingale arguments, of the consistency of kernel regression with dependent data. Another ...
متن کاملDiffusion Models and Steady-state Approximations for Exponentially Ergodic Markovian Queues by Itai Gurvich
Motivated by queues with many-servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove, approximates well that of the Markov chain. Strong approximations provide such “limitless” approximations for process dynamics. Our focus here is on steady-st...
متن کاملWeak approximation of martingale representations
We present a systematic method for computing explicit approximations to martingale representations for a large class of Brownian functionals. The approximations are based on a notion of pathwise functional derivative and yield a consistent estimator for the integrand in the martingale representation formula for any square-integrable functional of the solution of an SDE with path-dependent coeff...
متن کاملBounds for Markov Decision Processes
We consider the problem of producing lower bounds on the optimal cost-to-go function of a Markov decision problem. We present two approaches to this problem: one based on the methodology of approximate linear programming (ALP) and another based on the so-called martingale duality approach. We show that these two approaches are intimately connected. Exploring this connection leads us to the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004